Polyhedral methods for the maximum clique problem
نویسندگان
چکیده
This paper presents an integer programming approach to the maximum clique problem. An initial linear programming relaxation is solved and, when there is an integrality gap, this relaxation is strengthened using one of several tightening procedures. This is done through the addition of cutting planes to the linear program. The bulk of the paper deals with theoretical and computational issues associated with the generation of these cuts. In particular, we describe how to obtain cuts from the positive semi-definiteness of an underlying matrix. The various cuts are then compared in a computational experiment. These cuts can be incorporated into a branch-and-cut algorithm and we report results with such an algorithm on some of the DIMACS benchmark instances. kmmsi6n l?or " ■■ww-^ D^ I STIS ORA&I DS'IC TM O ImaaxioYMcaa Q Jus t if i s at i on_ liwstvibntimil K* Av6i3La"9in?,j Cfäöss Blot • Avail ßßfS/oji?
منابع مشابه
Polyhedral study of the maximum common induced subgraph problem
In this paper we present an exact algorithm for the Maximum Common Induced Subgraph Problem (MCIS) by addressing it directly, using Integer Programming (IP) and polyhedral combinatorics. We study the MCIS polytope and introduce strong valid inequalities, some of which we prove to define facets. Besides, we show an equivalence between our IP model for MCIS and a well-known formulation for the Ma...
متن کامل1 Parallel Semidefinite Programming and Combinatorial Optimization STEVEN
The use of semidefinite programming in combinatorial optimization continues to grow. This growth can be attributed to at least three factors: new semidefinite relaxations that provide tractable bounds to hard combinatorial problems, algorithmic advances in the solution of semidefinite programs (SDP), and the emergence of parallel computing. Solution techniques for minimizing combinatorial probl...
متن کاملOn clique-perfect and K-perfect graphs
A graph G is clique-perfect if the cardinality of a maximum cliqueindependent set of H is equal to the cardinality of a minimum cliquetransversal of H, for every induced subgraph H of G. When equality holds for every clique subgraph of G, the graph is c–clique-perfect. A graph G is K-perfect when its clique graph K(G) is perfect. In this work, relations are described among the classes of perfec...
متن کاملThe maximum clique problem
In this paper we present a survey of results concerning algorithms, complexity, and applications of the maximum clique problem. We discuss enumerative and exact algorithms, heuristics, and a variety of other proposed methods. An up to date bibliography on the maximum clique and related problems is also provided.
متن کاملThe Maximum Clique Problem Handbook Of Combinatorial Optimization
The maximum clique problem (MCP) is to determine a sub graph of maximum cardinality. A clique is a The corresponding optimization problem i.e. finding the maximum Maximum Clique Problem. in Handbook of Combinatorial. Common theme of every optimization problem: of semidefinite programming, A module on combinatorial optimization, Selected topics: The largest clique (i.e., complete subgraph)! In “...
متن کامل